a = [int(i)for i in input().split()]

def quickSort(left, right):

    if (left >= right):
        return
    i = (left + 1)
    j = right
    b = a[left]
    while (i < j):
        while (a[j] >= b and i < j):
            j -= 1
        while (a[i] <= b and i < j):
            i += 1
        if (i < j):
            a[i], a[j] = a[j], a[i]
    if (a[i] < b):
        a[i], a[left] = a[left], a[i]
        quickSort(left, i - 1)
        quickSort(i + 1, right)
    else:
        quickSort(left, i - 1)
        quickSort(i, right)

quickSort(0, 9)
for t in a:
    print(t, '', end = '')
print()